|
|
Publications of Josiane Zerubia
Result of the query in the list of publications :
173 Conference articles |
32 - Multi-class SVM for forestry classification.
N. Hajj Chehade and JG. Boureau and C. Vidal and J. Zerubia. In Proc. IEEE International Conference on Image Processing (ICIP), Cairo, Egypt, November 2009.
Keywords : Support Vector Machines, texture segmentation, Haralick feature, remote sensing, Forest vegetation.
@INPROCEEDINGS{Nabil09,
|
| author |
= |
{Hajj Chehade, N. and Boureau, JG. and Vidal, C. and Zerubia, J.}, |
| title |
= |
{Multi-class SVM for forestry classification}, |
| year |
= |
{2009}, |
| month |
= |
{November}, |
| booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
| address |
= |
{Cairo, Egypt}, |
| url |
= |
{http://dx.doi.org/10.1109/ICIP.2009.5413395}, |
| keyword |
= |
{Support Vector Machines, texture segmentation, Haralick feature, remote sensing, Forest vegetation} |
| } |
Abstract :
In this paper we propose a method for classifying the vegetation types in an aerial color infra-red (CIR) image. Different vegetation types do not only differ in color, but also in texture. We study the use of four Haralick features (energy, contrast, entropy, homogeneity) for texture analysis, and then perform the classification using the one-against-all (OAA) multi-class support vector machine (SVM), which is a popular supervised learning technique for classification. The choice of features (along with their corresponding parameters), the choice of the training set, and the choice of the SVM kernel highly affect the performance of the classification. The study was done on several CIR aerial images provided by the French National Forest Inventory (IFN). In this paper, we will show one example on a national forest near Sedan (in France), and compare our result with the IFN map. |
|
33 - Estimation des paramètres de processus ponctuels marqués dans le cadre de l'extraction d’objets en imagerie de télédétection.
F. Chatelain and X. Descombes and J. Zerubia. In Proc. Symposium on Signal and Image Processing (GRETSI), Dijon, France, November 2009.
@INPROCEEDINGS{cha09a,
|
| author |
= |
{Chatelain, F. and Descombes, X. and Zerubia, J.}, |
| title |
= |
{Estimation des paramètres de processus ponctuels marqués dans le cadre de l'extraction d’objets en imagerie de télédétection}, |
| year |
= |
{2009}, |
| month |
= |
{November}, |
| booktitle |
= |
{Proc. Symposium on Signal and Image Processing (GRETSI)}, |
| address |
= |
{Dijon, France}, |
| url |
= |
{http://hal.inria.fr/inria-00399258/fr/}, |
| keyword |
= |
{} |
| } |
|
34 - A phase field higher-order active contour model of directed networks.
A. El Ghoul and I. H. Jermyn and J. Zerubia. In 2nd IEEE Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, at ICCV, Kyoto, Japan, September 2009.
Keywords : Geometric prior, Shape, Higher-order actif contours, Phase Field, Directed networks.
Copyright : ©2009 IEEE.
@INPROCEEDINGS{ElGhoul09b,
|
| author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
| title |
= |
{A phase field higher-order active contour model of directed networks}, |
| year |
= |
{2009}, |
| month |
= |
{September}, |
| booktitle |
= |
{2nd IEEE Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, at ICCV}, |
| address |
= |
{Kyoto, Japan}, |
| url |
= |
{https://hal.inria.fr/inria-00409910}, |
| pdf |
= |
{http://hal.inria.fr/docs/00/40/99/10/PDF/nordia09aymenelghoul.pdf}, |
| keyword |
= |
{Geometric prior, Shape, Higher-order actif contours, Phase Field, Directed networks} |
| } |
Abstract :
The segmentation of directed networks is an important
problem in many domains, e.g. medical imaging (vascular
networks) and remote sensing (river networks). Directed
networks carry a unidirectional flow in each branch, which
leads to characteristic geometric properties. In this paper,
we present a nonlocal phase field model of directed networks.
In addition to a scalar field representing a region
by its smoothed characteristic function and interacting nonlocally
so as to favour network configurations, the model
contains a vector field representing the ‘flow’ through the
network branches. The vector field is strongly encouraged
to be zero outside, and of unit magnitude inside the region;
and to have zero divergence. This prolongs network
branches; controls width variation along a branch; and
produces asymmetric junctions for which total incoming
branch width approximately equals total outgoing branch
width. In conjunction with a new interaction function, it
also allows a broad range of stable branch widths. We
analyse the energy to constrain the parameters, and show
geometric experiments confirming the above behaviour. We
also show a segmentation result on a synthetic river image. |
|
35 - Algorithme rapide pour la restauration d'image régularisée sur les coefficients d'ondelettes.
M. Carlavan and P. Weiss and L. Blanc-Féraud and J. Zerubia. In Proc. Symposium on Signal and Image Processing (GRETSI), Dijon, France, September 2009.
Keywords : Deconvolution, nesterov scheme, Wavelets, l1 norm.
@INPROCEEDINGS{GRETSICarlavan09,
|
| author |
= |
{Carlavan, M. and Weiss, P. and Blanc-Féraud, L. and Zerubia, J.}, |
| title |
= |
{Algorithme rapide pour la restauration d'image régularisée sur les coefficients d'ondelettes}, |
| year |
= |
{2009}, |
| month |
= |
{September}, |
| booktitle |
= |
{Proc. Symposium on Signal and Image Processing (GRETSI)}, |
| address |
= |
{Dijon, France}, |
| url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/CarlavanGretsi09.pdf}, |
| pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/CarlavanGretsi09.pdf}, |
| keyword |
= |
{Deconvolution, nesterov scheme, Wavelets, l1 norm} |
| } |
Résumé :
De nombreuses méthodes de restauration d'images consistent à minimiser une énergie convexe. Nous nous focalisons sur l'utilisation de ces méthodes et considérons la minimisation de deux critères contenant une norme l1 des coefficients en ondelettes. La plupart des travaux publiés récemment proposent un critère à minimiser dans le domaine des coefficients en ondelettes, utilisant ainsi un a priori de parcimonie. Nous proposons un algorithme rapide et des résultats de déconvolution par minimisation d'un critère dans le domaine image, avec un a priori de régularité exprimé dans le domaine image utilisant une décomposition redondante sur une trame. L'algorithme et le modèle proposés semblent originaux pour ce problème en traitement d'images et sont performants en terme de temps de calculs et de qualité de restauration. Nous montrons des comparaisons entre les deux types d' a priori. |
Abstract :
Many image restoration techniques are based on convex energy minimization. We focus on the use of these techniques and consider the minimization of two criteria holding a l1-norm of wavelet coefficients. Most of the recent research works are based on the minimization of a criterion in the wavelet coefficients domain, namely as a sparse prior. We propose a fast algorithm and deconvolution results obtained by minimizing a criterion in the image domain using a redundant decomposition on a frame. The algorithm and model proposed are unusual for this problem and very efficient in term of computing time and quality of restoration results. We show comparisons between the two different priors. |
|
36 - Inflection point model under phase field higher-order active contours for network extraction from VHR satellite images.
A. El Ghoul and I. H. Jermyn and J. Zerubia. In Proc. European Signal Processing Conference (EUSIPCO), Glasgow, Scotland, August 2009.
Keywords : Geometric prior, Shape, Higher-order active contour, Phase Field, remote sensing.
Copyright : EURASIP
@INPROCEEDINGS{ElGhoul09a,
|
| author |
= |
{El Ghoul, A. and Jermyn, I. H. and Zerubia, J.}, |
| title |
= |
{Inflection point model under phase field higher-order active contours for network extraction from VHR satellite images}, |
| year |
= |
{2009}, |
| month |
= |
{August}, |
| booktitle |
= |
{Proc. European Signal Processing Conference (EUSIPCO)}, |
| address |
= |
{Glasgow, Scotland}, |
| url |
= |
{http://hal.inria.fr/inria-00390446/fr/}, |
| pdf |
= |
{http://hal.inria.fr/docs/00/39/04/46/PDF/eusipco09aymenelghoul.pdf}, |
| keyword |
= |
{Geometric prior, Shape, Higher-order active contour, Phase Field, remote sensing} |
| } |
Abstract :
The segmentation of networks is important in several imaging domains, and models incorporating prior shape knowledge are often essential for the automatic performance of this task. We incorporate such knowledge via phase fields and higher-order active contours (HOACs). In this paper: we introduce an improved prior model, the phase field HOAC ‘inflection point’ model of a network; we present an improved data term for the segmentation of road networks; we confirm the robustness of the resulting model to choice of gradient descent initialization; and we illustrate these points via road network extraction results on VHR satellite images. |
|
37 - Parameter estimation for marked point processes. Application to object extraction from remote sensing images. (poster).
F. Chatelain and X. Descombes and J. Zerubia. In Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Bonn, Germany, August 2009.
@INPROCEEDINGS{ChatelainEMMCVPR09,
|
| author |
= |
{Chatelain, F. and Descombes, X. and Zerubia, J.}, |
| title |
= |
{Parameter estimation for marked point processes. Application to object extraction from remote sensing images. (poster)}, |
| year |
= |
{2009}, |
| month |
= |
{August}, |
| booktitle |
= |
{Proc. Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR)}, |
| address |
= |
{Bonn, Germany}, |
| url |
= |
{http://link.springer.com/chapter/10.1007%2F978-3-642-03641-5_17}, |
| keyword |
= |
{} |
| } |
|
38 - Complex wavelet regularization for solving inverse problems in remote sensing.
M. Carlavan and P. Weiss and L. Blanc-Féraud and J. Zerubia. In Proc. IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Cape Town, South Africa, July 2009.
Keywords : Deconvolution, Dual smoothing, nesterov scheme, remote sensing, wavelet.
|
39 - Point-spread function retrieval for fluorescence microscopy.
P. Pankajakshan and L. Blanc-Féraud and Z. Kam and J. Zerubia. In Proc. IEEE International Symposium on Biomedical Imaging (ISBI), Publ. IEEE, Org. IEEE, Boston, USA, June 2009.
Keywords : fluorescence microscopy, point spread function, EM algorithm, Deconvolution.
Copyright : Copyright 2009 IEEE. Published in the 2009 International Symposium on Biomedical Imaging: From Nano to Macro (ISBI 2009), scheduled for June 28 - July 1, 2009 in Boston, Massachusetts, U.S.A. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ 08855-1331, USA. Telephone: + Intl. 908-562-3966.
@INPROCEEDINGS{ppankajakshan09a,
|
| author |
= |
{Pankajakshan, P. and Blanc-Féraud, L. and Kam, Z. and Zerubia, J.}, |
| title |
= |
{Point-spread function retrieval for fluorescence microscopy}, |
| year |
= |
{2009}, |
| month |
= |
{June}, |
| booktitle |
= |
{Proc. IEEE International Symposium on Biomedical Imaging (ISBI)}, |
| publisher |
= |
{IEEE}, |
| organization |
= |
{IEEE}, |
| address |
= |
{Boston, USA}, |
| pdf |
= |
{http://hal.inria.fr/docs/00/39/55/34/PDF/pankajakshan.pdf}, |
| keyword |
= |
{fluorescence microscopy, point spread function, EM algorithm, Deconvolution} |
| } |
Abstract :
In this paper we propose a method for retrieving the Point-Spread Function (PSF) of an imaging system given the observed images of fluorescent microspheres. Theoretically calculated PSFs often lack the experimental or microscope specific signatures while empirically obtained data are either over sized or (and) too noisy. The effect of noise and the influence of the microsphere size can be mitigated from the experimental data by using a Maximum Likelihood Expectation Maximization (MLEM) algorithm. The true experimental parameters can then be estimated by fitting the result to a model based on the scalar diffraction theory. The algorithm was tested on some simulated data and the results obtained validate the usefulness of the approach for retrieving the PSF from measured data. |
|
40 - Smoothing techniques for convex problems. Applications in image processing.
P. Weiss and M. Carlavan and L. Blanc-Féraud and J. Zerubia. In Proc. SAMPTA (international conference on Sampling Theory and Applications), Marseille, France, May 2009.
Keywords : nesterov scheme, convergence rate, Dual smoothing.
@INPROCEEDINGS{PWEISS_SAMPTA09,
|
| author |
= |
{Weiss, P. and Carlavan, M. and Blanc-Féraud, L. and Zerubia, J.}, |
| title |
= |
{Smoothing techniques for convex problems. Applications in image processing}, |
| year |
= |
{2009}, |
| month |
= |
{May}, |
| booktitle |
= |
{Proc. SAMPTA (international conference on Sampling Theory and Applications)}, |
| address |
= |
{Marseille, France}, |
| url |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Eusipco09.pdf}, |
| pdf |
= |
{http://www.math.univ-toulouse.fr/~weiss/Publis/Conferences/Sampta09.pdf}, |
| keyword |
= |
{nesterov scheme, convergence rate, Dual smoothing} |
| } |
Abstract :
In this paper, we present two algorithms to solve some inverse problems coming from the field of image processing. The problems we study are convex and can be expressed simply as sums of lp-norms of affine transforms of the image. We propose 2 different techniques. They are - to the best of our knowledge - new in the domain of image processing and one of them is new in the domain of mathematical programming. Both methods converge to the set of minimizers. Additionally, we show that they converge at least as O(1/N) (where N is the iteration counter) which is in some sense an ``optimal'' rate of convergence. Finally, we compare these approaches to some others on a toy problem of image super-resolution with impulse noise. |
|
41 - Dictionary-based probability density function estimation for high-resolution SAR data.
V. Krylov and G. Moser and S.B. Serpico and J. Zerubia. In Proc. of SPIE (IS&T/SPIE Electronic Imaging 2009), Vol. 7246, pages 72460S, San Jose, USA, January 2009.
Keywords : SAR image, Probability density function, parametric estimation, finite mixture models, Stochastic EM (SEM).
Copyright : SPIE
@INPROCEEDINGS{KrylovSPIE09,
|
| author |
= |
{Krylov, V. and Moser, G. and Serpico, S.B. and Zerubia, J.}, |
| title |
= |
{Dictionary-based probability density function estimation for high-resolution SAR data}, |
| year |
= |
{2009}, |
| month |
= |
{January}, |
| booktitle |
= |
{Proc. of SPIE (IS&T/SPIE Electronic Imaging 2009)}, |
| volume |
= |
{7246}, |
| pages |
= |
{72460S}, |
| address |
= |
{San Jose, USA}, |
| url |
= |
{http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=812524}, |
| pdf |
= |
{http://hal.archives-ouvertes.fr/inria-00361384/en/}, |
| keyword |
= |
{SAR image, Probability density function, parametric estimation, finite mixture models, Stochastic EM (SEM)} |
| } |
Abstract :
In the context of remotely sensed data analysis, a crucial problem is represented by the need to develop accurate models for the statistics of pixel intensities. In this work, we develop a parametric finite mixture model for the statistics of pixel intensities in high resolution synthetic aperture radar (SAR) images. This method is an extension of previously existing method for lower resolution images. The method integrates the stochastic expectation maximization (SEM) scheme and the method of log-cumulants (MoLC) with an automatic technique to select, for each mixture component, an optimal parametric model taken from a predefined dictionary of parametric probability density functions (pdf). The proposed dictionary consists of eight state-of-the-art SAR- specific pdfs: Nakagami, log-normal, generalized Gaussian Rayleigh, Heavy-tailed Rayleigh, Weibull, K-root, Fisher and generalized Gamma. The designed scheme is endowed with the novel initialization procedure and the algorithm to automatically estimate the optimal number of mixture components. The experimental results with a set of several high resolution COSMO-SkyMed images demonstrate the high accuracy of the designed algorithm, both from the viewpoint of a visual comparison of the histograms, and from the viewpoint of quantitive accuracy measures such as correlation coefficient (above 99,5%). The method proves to be effective on all the considered images, remaining accurate for multimodal and highly heterogeneous scenes. |
|
 top of the page
These pages were generated by 
|
2011 Activity report
get the bibtex
